Harmonious proportion

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Harmonious Hashing

Hashing-based fast nearest neighbor search technique has attracted great attention in both research and industry areas recently. Many existing hashing approaches encode data with projection-based hash functions and represent each projected dimension by 1-bit. However, the dimensions with high variance hold large energy or information of data but treated equivalently as dimensions with low varia...

متن کامل

Harmonious internal clock synchronization

Internal clock synchronization has been investigated, or employed, for quite a number of years, under the requirement of good upper bounds for the deviation, or accuracy, between a predefined master node M and slaves S1, S2, etc. It has been tacitly assumed that the accuracy range between slaves S1 and S2 was just the same as for the master/ slave. In extensive experimental studies of unicast-b...

متن کامل

Designing Harmonious Proportions

Analysis of work of art may be treated as some sort of classification of information: does the work is really artistic or not. This article is an attempt to introduce some classification criteria, though the author understands that the problem is extremely delicate and complicated. Attractiveness of work of art is determined by its proportions. The screen of a computer by itself is a mechanism ...

متن کامل

Feature The harmonious robot

Purpose – To describe the design methodology and human-centre functionality of the whole arm manipulator (WAM) developed originally at MIT and brought to commercial fruition by Barrett Technology. Design/methodology/approach – The WAM arm is driven by cable-and-cylinder transmissions, which uniquely exhibits zero backlash with low friction and low inertia, endowing the WAM with good open-loop “...

متن کامل

Upper bounds for harmonious colorings

A harmonious colouring of a simple graph G is a colouring of the vertices such that adjacent vertices receive distinct colours and each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring. We improve an upper bound on h(G) due to Lee and Mitchem, and give upper bounds for related quantities.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: British Dental Journal

سال: 2008

ISSN: 0007-0610,1476-5373

DOI: 10.1038/sj.bdj.2008.613